Rearrangeability of bit permutation networks
نویسندگان
چکیده
منابع مشابه
Rearrangeability of bit permutation networks
In this paper, we introduce the concept of routing grid as a tool for analyzing realizability of permutations on bit permutation networks (BPNs). We extend a result by Linial and Tarsi which characterizes permutations realizable on shuffle-exchange networks to any BPNs. A necessary condition for a BPN to be rearrangeable is given, and the rearrangeability of two families of BPNs are explored. F...
متن کاملCharacterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
A bit permutation network is an s-stage interconnection network composed of dn−1 d × d crossbar switches in each stage. This class of networks includes most of the multistage interconnection networks. Recently, Chang et al. [Networks 33 (1999), 261–267] showed that an sstage d-nary bit permutation network N with dn inputs (outputs) can be characterized by an (s − 1)-vector (k1, . . . , ks−1), w...
متن کاملChannel graphs of bit permutation networks
Channel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit permutation network has a unique channel graph if and only if it is connected, and two connected bit permutation networks are isomorphic if and only if their channel graphs are isomorphic. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملGraph Theoretical Characterizations of Bit Permutation Networks
The bit permutation networks (BPNs), proposed by Chang, Hwang and Tong (Networks, 33 (1999) 261-267), are a class of digraphs which include the underlying topological structure of almost all the commonly used switching networks or sorting networks. Many problems about BPNs have been intensively studied. Our work here is to present several graph theoretical characterizations of BPNs, which can b...
متن کاملOn the Rearrangeability of Shuffle-Exchange Networks
Let be the minimum positive integer so that the Shuffle-Exchange network with stages, inputs and outputs is rearrangeable. Beneš conjectured that . The best bounds known so far are . In this paper, we verify Beneš conjecture for , and use this result to show that . The case is considerably more complex than the case, which have been done in the literature. We believe that hidden in our proof th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.077